package ustc.xiaoyang.karl.binarysearch;

public class BinarySearch704 {
    public static void main(String[] args) {
        int[] nums = {-1,0,3,5,9,12};
        System.out.println(new BinarySearch704().search(nums, 9));
    }
    public int search(int[] nums,int target){
        int left = 0, right = nums.length - 1;
        while(left <= right){
            int mid = left + right >> 1;
            if(nums[mid] < target){
                left = mid + 1;
            } else if (nums[mid] > target) {
                right = mid - 1;
            }else{
                return mid;
            }
        }
        return -1;
    }
}
